Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems
نویسنده
چکیده
The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This method is now applied to permutation based problems. As demanded by Schiavinotto and Stützle, the distance in a search space is calculated by regarding the steps of the (neighborhood) operator. In this paper the five most common operators for permutations are analyzed on symmetric and asymmetric TSP instances. In addition a local quality measure, the point quality (PQ) is proposed as a supplement to the global FDC. With this local measure more characteristics and differences can be investigated. Some experimental results are illustrating these concepts.
منابع مشابه
Searching for a Permutation in a Haystack
We provide an overview of the Permutation in a Haystack problem, which serves as a tool for fitness landscape analysis, as well as in search algorithm design. The Permutation in a Haystack enables defining a search landscape for permutation optimization problems that abstracts the permutation features, which impact solution fitness, such as absolute element positions, edges, and pairwise elemen...
متن کاملDeveloping a Permutation Method Using Tabu Search Algorithm: A Case Study of Ranking Some Countries of West Asia and North Africa Based on Important Development Criteria
The recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. One of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...
متن کاملHybrid Teaching-Learning-Based Optimization and Harmony Search for Optimum Design of Space Trusses
The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...
متن کاملAn iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem
This paper presents the first fitness landscape analysis on the delay-constrained least-cost multicast routing problem (DCLC-MRP), a well-known NP-hard problem. Although the problem has attracted an increasing research attention over the past decade in telecommunications and operational research, little research has been conducted to analyze the features of its underlying landscape. Two of the ...
متن کاملFitness Landscape Analysis of Hyper-Heuristic Transforms for the Vertex Cover Problem
Hyper-heuristics have recently proved efficient in several areas of combinatorial search and optimization, especially scheduling. The basic idea of hyperheuristics is based on searching for search-strategy. Instead of traversing the solution-space, the hyper-heuristic traverses the space of algorithms to find or construct an algorithm best suited for the given problem instance. The observed eff...
متن کامل